翻訳と辞書 Words near each other ・ Minimum viable product ・ Minimum wage ・ Minimum Wage Fairness Act ・ Minimum Wage Fixing Convention, 1970 ・ Minimum Wage Fixing Machinery (Agriculture) Convention, 1951 ・ Minimum wage in Canada ・ Minimum wage in China ・ Minimum wage in Romania ・ Minimum wage in Taiwan ・ Minimum wage in the United States ・ Minimum wage law ・ Minimum Wage Ordinance ・ Minimum Wage-Fixing Machinery Convention, 1928 ・ Minimum Wages Act 1948 ・ Minimum weight ・ Minimum-cost flow problem ・ Minimum-Maximum ・ Minimum-Maximum (video) ・ Minimum-shift keying ・ Minimum-variance unbiased estimator ・ Minimum-weight triangulation ・ Minimumweight ・ Minimundus ・ Minimus ・ Minimusical ・ Minin ・ Minin and Pozharsky ・ Minin and Pozharsky (film) ・ Minina Skerries ・ Mininco River Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Minimum-cost flow problem ： ウィキペディア英語版 Minimum-cost flow problem The minimum-cost flow problem (MCFP) is to find the cheapest possible way of sending a certain amount of flow through a flow network. Typical application of this problem involves finding the best delivery route from a factory to a warehouse where the road network has some capacity and cost associated. The minimum cost flow problem is one of the most fundamental among all flow and circulation problems because most other such problems can be cast as a minimum cost flow problem and also that it can be solved very efficiently using the network simplex algorithm. == Definition == Given a flow network, that is, a directed graph $G=(V,E)$ with source $s\; \backslash in\; V$ and sink $t\; \backslash in\; V$, where edge $(u,v)\; \backslash in\; E$ has capacity $c(u,v)\; >\; 0$, flow $f(u,v)\; \backslash ge\; 0$ and cost $a(u,v)$ (most minimum-cost flow algorithms support edges with negative costs). The cost of sending this flow is $f(u,v)\backslash cdot\; a(u,v)$. You are required to send an amount of flow $d$ from $s$ to $t$. The definition of the problem is to minimize the total cost of the flow: :$\backslash sum\_\; a(u,v)\; \backslash cdot\; f(u,v)$ with the constraints : u \neq s, t |- | Required flow: || $\backslash ,\backslash sum\_\; f(s,w)\; =\; d\; \backslash text\; \backslash sum\_\; f(w,t)\; =\; d$ |} 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Minimum-cost flow problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.